Security Concerns in Minimum Storage Cooperative Regenerating Codes
نویسندگان
چکیده
منابع مشابه
Searching for Minimum Storage Regenerating Codes
Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملEnabling All-Node-Repair in Minimum Storage Regenerating Codes
We consider the problem of constructing exact-repair minimum storage regenerating (MSR) codes, for which both the systematic nodes and parity nodes can be repaired optimally. Although there exist several recent explicit high-rate MSR code constructions (usually with certain restrictions on the coding parameters), quite a few constructions in the literature only allow the optimal repair of syste...
متن کاملExtended Functional Minimum-Storage Cooperative Regenerating for Cloud Bandwidth Problem
Cloud storage systems to protect data from corruptions, redundant data to be tolerate failures of storage and lost data should be repaired when storage fails. Regenerating codes provide fault tolerance by striping data across multiple servers, while using less repair traffic than minimized bandwidth consumption. In previous research implemented practical Data Integrity Protection (DIP) scheme f...
متن کاملGeneralization of Rashmi-Shah-Kumar Minimum-Storage-Regenerating Codes
In this paper, we propose a generalized version of the Rashmi-Shah-Kumar Minimum-Storage-Regenerating(RSKMSR) codes based on the product-matrix framework. For any (n, k, d) such that d ≥ 2k − 2 and d ≤ n − 1, we can directly construct an (n, k, d) MSR code without constructing a larger MSR code and shortening of the larger MSR code. As a result, the size of a finite field over which the propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2608949